Łukasiewicz and Leśniewski on Contradiction

نویسندگان

  • ARIANNA BETTI
  • P. M. Simons
چکیده

It was in 1911 that Łukasiewicz and Leśniewski met. Leśniewski himself reported that at that time he had read Łukasiewicz’s masterpiece On the Principle of Contradiction in Aristotle (1910), and, as Lejewski knew from Łukasiewicz, he said he had come to criticize the author. In the same year Leśniewski wrote “An Attempt at a Proof of the Principle of Contradiction”, which was published in 1912 on Przegląd Filozoficzny and was addressed on the whole against Łukasiewicz’s book. Whereas the role played by the principle of contradiction in the development of Łukasiewicz’s ideas is generally speaking correctly underlined, it is not so in Leśniewski’s case. Surely the oblivion which covered Leśniewski’s early writings prevented the scholars from regarding the issue worthy of inquiry in his philosophy. Yet the controversy between Leśniewski and Łukasiewicz on the principle of contradiction may be considered quite rightly a touchstone between their very distant philosophical attitudes, which remained that way also later. It is hard to exaggerate the great weight Łukasiewicz’s monograph had in the Polish logico-philosophical scene. Although polemically inspired, Leśniewski did acknowledge the importance of Łukasiewicz’s work:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lukasiewicz Logic Based Prolog

Prolog is a programming language based on a restricted subset of classical rst order predicate logic. In order to overcome some problems of classical logic to handle imperfect human knowledge, we provide a formal framework for a Lukasiewicz logic based Prolog system. The use of Lukasiewicz logic with its connection to Ulam games enables us to deal with partial inconsistencies by interpreting th...

متن کامل

Prefix-Free Łukasiewicz Languages

Generalised Łukasiewicz languages are simply described languages having good information-theoretic properties. An especially desirable property is the one of being a prefix code. This paper addresses the question under which conditions a generalised Łukasiewicz language is a prefix code. Moreover, an upper bound on the delay of decipherability of a generalised Łukasiewicz language is derived.

متن کامل

Łukasiewicz Games

Boolean games provide a simple, compact, and theoretically attractive abstract model for studying multi-agent interactions in settings where players will act strategically in an attempt to achieve personal goals. A standard critique of Boolean games, however, is that the binary nature of goals (satisfied or unsatisfied) inevitably trivialises the nature of such strategic interactions: a player ...

متن کامل

A Computational Logic Approach to the Suppression Task

A novel approach to human conditional reasoning based on the three-valued Łukasiewicz logic is presented. We will demonstrate that the Łukasiewicz logic overcomes problems the sofar proposed Fitting logic has in reasoning with the suppression task. The approach can be implemented by an appropriate connectionist network. While adequately solving the suppression task, the approach gives rise to a...

متن کامل

Querying with Łukasiewicz logic

In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of Łukasiewicz propositional logic to query databases in a fuzzy way. Our approach distinguishes itself for its stress on the purely linguistic, contraposed with numeric, formulations of queries. Our queries are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997